Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding
نویسندگان
چکیده
منابع مشابه
A Near-Linear Time ε-Approximation Algorithm for Geometric Bipartite
For point sets A,B ⊂ R, |A| = |B| = n, and for a parameter ε > 0, we present a Monte Carlo algorithm that computes, in O(npoly(log n, 1/ε)) time, an ε-approximate perfect matching of A and B under any Lp-norm with high probability; the previously best known algorithm takes Ω(n) time. We approximate the Lp-norm using a distance function, d(·, ·) based on a randomly shifted quad-tree. The algorit...
متن کاملA Near-Linear Pseudopolynomial Time Algorithm for Subset Sum
Given a set Z of n positive integers and a target value t, the SubsetSum problem asks whether any subset of Z sums to t. A textbook pseudopolynomial time algorithm by Bellman from 1957 solves SubsetSum in time O(n t). This has been improved to O(nmaxZ) by Pisinger [J. Algorithms’99] and recently to Õ(√n t) by Koiliaris and Xu [SODA’17]. Here we present a simple and elegant randomized algorithm ...
متن کاملn-fold Commutative Hyper K-ideals
In this paper, we aresupposed to introduce the definitions of n-fold commutative, andimplicative hyper K-ideals. These definitions are thegeneralizations of the definitions of commutative, andimplicative hyper K-ideals, respectively, which have been definedin [12]. Then we obtain some related results. In particular wedetermine the relationships between n-fold implicative hyperK-ideal and n-fol...
متن کاملA Linear Time Algorithm for Near Minimax Continuous Piecewise Linear Representations of Discrete Data
An algorithm that constructs a continuous piecewise linear representation, subject to a certain slope/segment length constraint, of a given set of data is described. The algorithm yields an optimal or near optimal representation, subject to this constraint, in the L∞ norm and does so in at worst O(nK) time, where n is the number of data points and K the number of segments. The constraint is det...
متن کاملIndex coding via linear programming
Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and efficient communication in wireless networks and in part by its connection to Network Coding. Optimal encoding schemes and efficient heuristics were studied in various settings, alongside leading to new results for Network Coding such as improved gaps between linear and n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2020
ISSN: 0895-4801,1095-7146
DOI: 10.1137/19m1303873